On a sequence of sparse binomial-type polynomials
نویسندگان
چکیده
منابع مشابه
Binomial Identities Involving The Generalized Fibonacci Type Polynomials
We present some binomial identities for sums of the bivariate Fi-bonacci polynomials and for weighted sums of the usual Fibonacci polynomials with indices in arithmetic progression.
متن کاملA Class of Binomial Permutation Polynomials
For a prime power q, let Fq be the finite field with q elements and F ∗ q denote its multiplicative group. A polynomial f ∈ Fq[x] is called a permutation polynomial (PP) if its associated polynomial mapping f : c 7→ f(c) from Fq to itself is a bijection. A permutation polynomial f(x) is referred to as a complete permutation polynomial (CPP) if f(x)+x is also a permutation over Fq [4]. Permutati...
متن کاملthe investigation of the relationship between type a and type b personalities and quality of translation
چکیده ندارد.
On the evaluation of some sparse polynomials
We give algorithms for the evaluation of sparse polynomials of the form P = p0 + p1x + p2x 4 + · · ·+ pN−1x 2 , for various choices of coefficients pi. First, we take pi = p i, for some fixed p; in this case, we address the question of fast evaluation at a given point in the base ring, and we obtain a cost quasi-linear in √ N . We present experimental results that show the good behavior of this...
متن کاملOn Some Computations on Sparse Polynomials
In arithmetic circuit complexity the standard operations are {+,×}. Yet, in some scenarios exponentiation gates are considered as well (see e.g. [6, 1, 28, 30]). In this paper we study the question of efficiently evaluating a polynomial given an oracle access to its power. Among applications, we show that: A reconstruction algorithm for a circuit class C can be extended to handle f for f ∈ C. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2013
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2012.08.004